Exponential Smoothing for Multi-Product Lot-Sizing With Heijunka and Varying Demand
نویسندگان
چکیده
منابع مشابه
Three Metaheuristic Algorithms for Solving the Multi-item Capacitated Lot-sizing Problem with Product Returns and Remanufacturing
This paper proposes a new mixed integer programming model for multi-item capacitated lot-sizing problem with setup times, safety stock and demand shortages in closed-loop supply chains. The returned products from customers can either be disposed or be remanufactured to be sold as new ones again. Due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (SA) al...
متن کاملMulti-product lot-sizing and scheduling on unrelated parallel machines
We study a problem of optimal scheduling and lot-sizing a number of products on m unrelated parallel machines to satisfy given demands. A sequence dependent setup time is required between lots of different products. The products are assumed to be all continuously divisible or all discrete. The criterion is to minimize the time, at which all the demands are satisfied, Cmax, or the maximum latene...
متن کاملAn Extension of the Multi-machine Multi-level Proportional Lot Sizing and Scheduling Model for Product-Life-Cycle Demand
Often lot sizing and scheduling models have neglected the consideration of influence of product life cycles (PLCs). But, accordingly as desirable in a firm’s production strategy, decisions of lot sizing scheduling may have to respond to the stage changes in a product’s life cycle. In this paper, we propose an extension of the lot sizing scheduling, the multi-item, multi-level product-structure...
متن کاملthree metaheuristic algorithms for solving the multi-item capacitated lot-sizing problem with product returns and remanufacturing
this paper proposes a new mixed integer programming model for multi-item capacitated lot-sizing problem with setup times, safety stock and demand shortages in closed-loop supply chains. the returned products from customers can either be disposed or be remanufactured to be sold as new ones again. due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (sa) al...
متن کاملOn Multi-product Lot-Sizing and Scheduling with Multi-machine Technologies
We consider a problem of multi-product lot-sizing and scheduling where each product can be produced by a family of alternative multi-machine technologies. Multi-machine technologies require one or more machine at the same time. A sequence dependent setup time is needed between different technologies. The criterion is to minimize the makespan. Preemptive and non-preemptive versions of the proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Management and Production Engineering Review
سال: 2014
ISSN: 2082-1344
DOI: 10.2478/mper-2014-0013